منابع مشابه
Breakpoint Detection Using Covariance Propagation
This paper presents a novel statistical approach for detecting breakpoints from chain encoded digital arcs. An arc point is declared as a breakpoint if the estimated orientations of the two fitted lines of the two arc segments immediately to the right and left of the arc point are significantly statistically different. The major contributions of this research include developing a method for ana...
متن کاملCovariance Propagation for Guided Matching
We present a general approach and analytical method for determining a search region for use in guided matching under projective mappings. Our approach is based on the propagation of covariance through a first-order approximation of the error model to define the boundary of the search region for a specified probability and we provide an analytical expression for the Jacobian matrix used in the c...
متن کاملCorner Detection with Covariance Propagation
This paper presents a statistical approach for detecting corners from chain encoded digital arcs. An arc point is declared as a corner if the estimated parameters of the two fitted lines of the two arc segments immediately to the right and left of the arc point are statistically significantly different. The corner detection algorithm consists of two steps: corner detection and optimization. Whi...
متن کاملUnderstanding Covariance Estimates in Expectation Propagation
Bayesian inference for most models of modern interest requires approximation of the posterior distribution. Variational inference (VI) methods formulate posterior approximation as a particular optimization problem and have grown in popularity due to their fast runtime on large datasets. There is recent work that suggests it might be beneficial to instead consider an alternative optimization obj...
متن کاملBelief Propagation and Spectral Methods Belief Propagation and Spectral Methods
We investigate an algorithm derived based on the belief propagation method of Pearl [11] applied to the (Min-)Bisection problem under the standard planted solution model (or more precisely the Most Likely Partition problem under the same planted solution model). We first point out that the algorithm (without thresholding) is nothing but the standard power method for computing an eigenvector wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Data Sheets
سال: 2015
ISSN: 0090-3752
DOI: 10.1016/j.nds.2014.12.018